Laplacian pretty good fractional revival
نویسندگان
چکیده
We develop the theory of pretty good fractional revival in quantum walks on graphs using their Laplacian matrices as Hamiltonian. classify paths and double stars that have revival.
منابع مشابه
Pretty Good Gravity
A theory of topological gravity is a homotopy-theoretic representation of the Segal-Tillmann topologification of a two-category with cobordisms as morphisms. This note describes a relatively accessible example of such a thing, suggested by the wall-crossing formulas of Donaldson theory. 1. Gravity categories A cobordism category has manifolds as objects, and cobordisms as morphisms. Such catego...
متن کاملPretty Good Democracy
Code voting seeks to address the issues of privacy and integrity for Remote Internet Voting. It sidesteps many of the inherent vulnerabilities of the Internet and client platforms but it does not provide end-to-end verification that votes are counted as cast. In this paper, we propose a simple technique to enhance the verifiability of code voting by ensuring that the Vote Server can only access...
متن کاملPretty Good Packet Authentication
Internet addresses are routinely being used to infer the identity of persons who send offending traffic – a capability they were not designed to provide. As a result, problems abound: innocent users are being accused, while the culprits can easily avoid detection. In this paper, we present Pretty Good Packet Authentication (PGPA), a simple service that can establish whether or not a given host ...
متن کاملPretty Good Voting
Recent academic assessments of the potential for secure Internet-based voting have been extremely pessimistic. A panel assembled to review the Department of Defense’s SERVE (Secure Electronic Registration and Voting Experiment) project– a system designed to allow foreign-based members of the armed services to vote online in Federal elections, which was nearly deployed for the 2004 election–conc...
متن کاملSatisficing: A ‘Pretty Good’ Heuristic
One of the best known ideas in the study of bounded rationality is Simon’s satisficing; yet we still lack a standard formalization of the heuristic and its implications. We propose a mathematical model of satisficing which explicitly represents agents’ aspirations and which explores both singleperson and multi-player contexts. The model shows that satisficing has a signature performanceprofile ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2022
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.112971